RSA with Chinese Reminder Theorem Immune to Fault Cryptanalysis
نویسندگان
چکیده
This article examines the problem of fast RSA encryption with Chinese Reminder Theorem (CRT) immune against hardware fault cryptanalysis. This type of RSA scheme has been widely adopted as a standard implementation in many applications ranging from large servers to tiny smart cards. However, single error in this scheme can totally break the whole RSA scheme by factoring public modulus. It will be pointed out in this paper that very few of this existing solutions are both sound and effective. We will define hardware faults that enable to brake schemes of RNS encoding known in an open literature in at most three RSA computations. We also propose a new CRT-based RSA scheme that is immune to fault cryptanalysis.
منابع مشابه
RSA Speedup with Chinese Remainder Theorem Immune against Hardware Fault Cryptanalysis
This article considers the problem of how to prevent the fast RSA signature and decryption computation with residue number system (or called the CRT-based approach) speedup from a hardware fault cryptanalysis in a highly reliable and efficient approach. The CRT-based speedup for RSA signature has been widely adopted as an implementation standard ranging from large servers to very tiny smart IC ...
متن کاملSecuring RSA against Fault Analysis by Double Addition Chain Exponentiation
Fault Analysis is a powerful cryptanalytic technique that enables to break cryptographic implementations embedded in portable devices more efficiently than any other technique. For an RSA implemented with the Chinese Remainder Theorem method, one faulty execution suffices to factorize the public modulus and fully recover the private key. It is therefore mandatory to protect embedded implementat...
متن کاملThe Rabin Cryptosystem & analysis in measure of Chinese Reminder Theorem
Cryptography is the practise and study of techniques for secure communication in the presence of third parties. The necessity and the fact that exchanged messages are exposed to other people during the transmission promoted the creation of encryption systems, enabling just the recipients to interpret the exchanged information. In this paper, a particular cryptosystem called Rabin Cryptosystem i...
متن کاملCryptanalysis of Multi Prime RSA with Secret Key Greater than Public Key
The efficiency of decryption process of Multi prime RSA, in which the modulus contains more than two primes, can be speeded up using Chinese remainder theorem (CRT). On the other hand, to achieve the same level of security in terms integer factorization problem the length of RSA modulus must be larger than the traditional RSA case. In [9], authors studied the RSA public key cryptosystem in a sp...
متن کاملCRT RSA Algorithm Protected Against Fault Attacks
Embedded devices performing RSA signatures are subject to Fault Attacks, particularly when the Chinese Remainder Theorem is used. In most cases, the modular exponentiation and the Garner recombination algorithms are targeted. To thwart Fault Attacks, we propose a new generic method of computing modular exponentiation and we prove its security in a realistic fault model. By construction, our pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004